#define  _CRT_SECURE_NO_WARNINGS 1

// https://www.nowcoder.com/questionTerminal/49e3ab38479a4b81a13e0afd9bb5a09d

#include <iostream>
#include <vector>
using namespace std;

// 冒泡排序
void BubbleSort(vector<int>& v, int n)
{}

// 快速排序
void QuickSort(vector<int>& v, int left, int right)
{}

// 直接插入排序
void InsertSort(vector<int>& v, int n)
{}

// 希尔排序
void ShellSort(vector<int>& v, int n)
{}

// 选择排序
void SelectSort(vector<int>& v, int n)
{}

// 堆排序
void HeapSort(vector<int>& v, int n)
{}

// 归并排序
void MergeSort(vector<int>& v, int n)
{}

// 计数排序
void CountSort(vector<int>& v, int n)
{}

int main()
{
	int n = 0;
	cin >> n;
	vector<int> v(n);
	for (auto& e : v)
		cin >> e;

	//BubbleSort(v, n);
	//QuickSort(v, 0, n - 1);
	//InsertSort(v, n);
	//ShellSort(v, n);
	//SelectSort(v, n);
	//HeapSort(v, n);
	//MergeSort(v, n);
	//CountSort(v, n);

	for (int i = 0; i < n; ++i)
	{
		if (i != n - 1)
			cout << v[i] << ' ';
		else
			cout << v[i] << endl;
	}
	return 0;
}
